A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs

The problem of enumerating connected induced subgraphs a given graph is classical and studied well. It known that can be enumerated in constant time for each subgraph. In this paper, we focus on highly subgraphs. most major concept connectivity graphs vertex connectivity. For connectivity, some enumeration settings algorithms have been proposed, such as k-vertex spanning another edge-connectivity. This motivated by the finding evacuation routes road networks. routes, edge-connectivity important, since edge-connected ensure multiple between two vertices. consider 2-edge-connected graph. We present an algorithm enumerates input G with n vertices m edges. Our all O(n3m|SG|) time, where SG set G. Moreover, slightly modifying algorithm, O(n3m)-delay